Cyclic additive codes and cyclic quantum stabilizer codes

نویسنده

  • Jürgen Bierbrauer
چکیده

The theory of cyclic linear codes in its ring-theoretic formulation is a core topic of classical coding theory. A simplified approach is in my textbook [1]. The language of ring theory is not needed. We will present a self-contained description of the more general theory of cyclic additive codes using the same method. This includes cyclic quantum stabilizer codes as a special case. The basic ingredients needed are finite field extensions, their Galois groups, the trace, cyclotomic cosets, Lagrange interpolation and bilinear forms, not more. This is based on the paper [2].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Quantum Stabilizer Codes From Quadratic Residues Sets

We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form p = 4n ± 1. The proposed Type-I stabilizer codes are of cyclic structure and code length N = p. They are constructed based on multi-weight circulant matrix generated from idempotent polynomial, which is obtained from a quadratic residue set. The proposed Type...

متن کامل

Quantum Stabilizer and Subsystem Codes from Algebro-geometric Toric Codes

We show how to construct quantum stabilizer and subsystem codes from algebro-geometric toric codes extending the known construction of subsystem codes from cyclic codes and extending the construction of stabilizer codes from toric codes in an earlier work by one of the authors. Since algebrogeometric toric codes are higher dimensional extensions of cyclic codes, we obtain this way a new and ric...

متن کامل

Stabilizer codes from modified symplectic form

Stabilizer codes form an important class of quantum error correcting codes[10, 2, 5] which have an elegant theory, efficient error detection, and many known examples. Constructing stabilizer codes of length n is equivalent to constructing subspaces of Fp ×Fp which are isotropic under the symplectic bilinear form defined by ⟨(a,b), (c,d)⟩ = aTd − bTc [10, 12, 1]. As a result, many, but not all, ...

متن کامل

Two Families of Quantum Codes Derived from Cyclic Codes

We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer [[n, 1,≥ n]]q codes is derived from the classical duadic codes. This answer an open problem asked by Aly et al. MSC:[94B05, 94B15, 94B60 ]

متن کامل

Some notes on the characterization of two dimensional skew cyclic codes

‎‎A natural generalization of two dimensional cyclic code ($T{TDC}$) is two dimensional skew cyclic code‎. ‎It is well-known that there is a correspondence between two dimensional skew cyclic codes and left ideals of the quotient ring $R_n:=F[x,y;rho,theta]/_l$‎. ‎In this paper we characterize the left ideals of the ring $R_n$ with two methods and find the generator matrix for two dimensional s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011